Recurrence and Pólya Number of Quantum Walks
نویسندگان
چکیده
منابع مشابه
Recurrence in Quantum Walks Probing Measurement Induced Effects in Quantum Walks via Recurrence
Measurements on a quantum particle unavoidably affect its state, since the otherwise unitary evolution of the system is interrupted by a non-unitary projection operation. In order to probe measurement-induced effects in the state dynamics using a quantum simulator, the challenge is to implement controlled measurements on a small subspace of the system and continue the evolution from the complem...
متن کاملNovel pseudo-random number generator based on quantum random walks
In this paper, we investigate the potential application of quantum computation for constructing pseudo-random number generators (PRNGs) and further construct a novel PRNG based on quantum random walks (QRWs), a famous quantum computation model. The PRNG merely relies on the equations used in the QRWs, and thus the generation algorithm is simple and the computation speed is fast. The proposed PR...
متن کاملRecurrence of cocycles and stationary random walks
We survey distributional properties of R-valued cocycles of finite measure preserving ergodic transformations (or, equivalently, of stationary random walks in R) which determine recurrence or transience. Let (Xn, n ≥ 0) be an ergodic stationary Rd-valued stochastic process, and let (Yn = X0 + · · · + Xn−1, n ≥ 1) be the associated random walk. What can one say about recurrence of this random wa...
متن کاملQuantum walks and quantum computation
The field of quantum information applies the concepts of quantum physics to problems in computer science, and shows great potential for allowing efficient computation. In this thesis I concentrate on a particular quantum information theoretic tool known as the quantum walk. There are two widely studied versions of the quantum walk, the continuous time walk, and the discrete time walk. The discr...
متن کاملQuantum Walks, Quantum Gates, and Quantum Computers
The physics of quantum walks on graphs is formulated in Hamiltonian language, both for simple quantum walks and for composite walks, where extra discrete degrees of freedom live at each node of the graph. It is shown how to map between quantum walk Hamiltonians and Hamiltonians for qubit systems and quantum circuits; this is done for both a singleand multi-excitation coding, and for more genera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2008
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.100.020501